Effectively closed sets of measures and randomness
نویسنده
چکیده
We show that if a real x ∈ 2 is strongly Hausdorff Hh-random, where h is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure μ such that the μ-measure of the basic open cylinders shrinks according to h. The proof uses a new method to construct measures, based on effective (partial) continuous transformations and a basis theorem for Π1-classes applied to closed sets of probability measures. We use the main result to give a new proof of Frostman’s Lemma, to derive a collapse of randomness notions for Hausdorff measures, and to provide a characterization of effective Hausdorff dimension similar to Frostman’s Theorem.
منابع مشابه
Effective Capacity and Randomness of Closed Sets
We investigate the connection between measure and capacity for the space C of nonempty closed subsets of 2N. For any computable measure μ∗, a computable capacity T may be defined by letting T (Q) be the measure of the family of closed sets K which have nonempty intersection with Q. We prove an effective version of the Choquet’s theorem by showing that every computable capacity may be obtained f...
متن کاملMartin-Löf random generalized Poisson processes
Martin-Löf randomness was originally defined and studied in the context of the Cantor space 2ω . In [1] probability theoretic random closed sets (RACS) are used as the foundation for the study of Martin-Löf randomness in spaces of closed sets. Here we focus on the space of closed subsets of R and a particular family of measures on this space, the generalized Poisson processes. This gives a nove...
متن کاملAlgorithmic Randomness and Capacity of Closed Sets
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be de ned by letting T (Q) be the measure of the family of closed sets K which have nonempty intersection with Q. We prove an e ective version of Choquet's capacity theorem by showing that every computable capacity may be obta...
متن کاملAlgorithmically random closed sets and probability
by Logan M. Axon Algorithmic randomness in the Cantor space, 2 ω , has recently become the subject of intense study. Originally defined in terms of the fair coin measure, algorithmic randomness has since been extended, for example in Reimann and Slaman [22, 23], to more general measures. Others have meanwhile developed definitions of algorithmic randomness for different spaces, for example the ...
متن کاملE ective Randomness of Unions and Intersections
We investigate the -randomness of unions and intersections of random sets under various notions of randomness corresponding to di erent probability measures. For example, the union of two relatively MartinL of random sets is not Martin-L of random but is random with respect to the Bernoulli measure 3 4 under which any number belongs to the set with probability 3 4 . Conversely, any 3 4 random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 156 شماره
صفحات -
تاریخ انتشار 2008